Finding MAPs Using High Order Recurrent Networks
نویسندگان
چکیده
Belief revision is the problem of finding the most plausible explanation for an observed set of evidences. This has many applications in various scientific domains like natural language understanding, medical diagnosis and computational biology. Bayesian Networks (BN) is an important probabilistic graphical formalism used widely for belief revision tasks. In BN, belief revision can be achieved by setting the values of all random variables such that their joint probability is maximized. This assignment is called the maximum a posteriori (MAP) assignment. Finding MAP is an NP-Hard problem. In this paper, we are proposing finding the MAP assignment in BN using High Order Recurrent Neural Networks through an intermediate representation of Cost-Based Abduction. This method will eliminate the need to explicitly construct the energy function in two steps, objective and constraints, which will decrease the number of free parameters to set.
منابع مشابه
Finding MAPs using strongly equivalent high order recurrent symmetric connectionist networks
Belief revision is the problem of finding the most plausible explanation for an observed set of evidences. It has many applications in various scientific domains like natural language understanding, medical diagnosis and computational biology. Bayesian Networks (BN) is an important probabilistic graphical formalism widely used for belief revision tasks. In BN, belief revision can be achieved by...
متن کاملSteel Consumption Forecasting Using Nonlinear Pattern Recognition Model Based on Self-Organizing Maps
Steel consumption is a critical factor affecting pricing decisions and a key element to achieve sustainable industrial development. Forecasting future trends of steel consumption based on analysis of nonlinear patterns using artificial intelligence (AI) techniques is the main purpose of this paper. Because there are several features affecting target variable which make the analysis of relations...
متن کاملRobust stability of stochastic fuzzy impulsive recurrent neural networks with\ time-varying delays
In this paper, global robust stability of stochastic impulsive recurrent neural networks with time-varyingdelays which are represented by the Takagi-Sugeno (T-S) fuzzy models is considered. A novel Linear Matrix Inequality (LMI)-based stability criterion is obtained by using Lyapunov functional theory to guarantee the asymptotic stability of uncertain fuzzy stochastic impulsive recurrent neural...
متن کاملSearching for Robust Chaos in Discrete Time Neural Networks using Weight Space Exploration
A method for analysis and synthesis of recurrent discrete time neural networks with robust chaotic behavior is presented. Using this method, a new nonlinear activation function called saturated modulus was found to be the most efficient in order to get chaos even in small sizes neural networks. Based on weight space exploring using a searching strategy closely related with genetic algorithms, s...
متن کاملDetermination of Best Supervised Classification Algorithm for Land Use Maps using Satellite Images (Case Study: Baft, Kerman Province, Iran)
According to the fundamental goal of remote sensing technology, the image classification of desired sensors can be introduced as the most important part of satellite image interpretation. There exist various algorithms in relation to the supervised land use classification that the most pertinent one should be determined. Therefore, this study has been conducted to determine the best and most su...
متن کامل